On the speed of biased random walk in translation invariant percolation

نویسندگان

  • Maria Deijfen
  • Olle Häggström
چکیده

For biased random walk on the infinite cluster in supercritical i.i.d. percolation on Z, where the bias of the walk is quantified by a parameter β > 1, it has been conjectured (and partly proved) that there exists a critical value βc > 1 such that the walk has positive speed when β < βc and speed zero when β > βc. In this paper, biased random walk on the infinite cluster of a certain translation invariant percolation process on Z is considered. The example is shown to exhibit the opposite behavior to what is expected for i.i.d. percolation, in the sense that it has a critical value βc such that, for β < βc, the random walk has speed zero, while, for β > βc, the speed is positive. Hence the monotonicity in β that is part of the conjecture for i.i.d. percolation cannot be extended to general translation invariant percolation processes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The speed of biased random walk on percolation clusters

We consider biased random walk on supercritical percolation clusters in Z. We show that the random walk is transient and that there are two speed regimes: If the bias is large enough, the random walk has speed zero, while if the bias is small enough, the speed of the random walk is positive.

متن کامل

Percolation Perturbations in Potential Theory and Random Walks

We show that on a Cayley graph of a nonamenable group, a.s. the infinite clusters of Bernoulli percolation are transient for simple random walk, that simple random walk on these clusters has positive speed, and that these clusters admit bounded harmonic functions. A principal new finding on which these results are based is that such clusters admit invariant random subgraphs with positive isoper...

متن کامل

Random Walk on Periodic Treeschristiane Takacs

Following Lyons (1990, 4]) we deene a periodic tree, restate its branching number and consider a biased random walk on it. In the case of a transient walk, we describe the walk-invariant random periodic tree and calculate the asymptotic rate of escape (speed) of the walk. This is achieved by exploiting the connections between random walks and electric networks. 1. Introduction This paper deals ...

متن کامل

Random Walk on Periodic Trees

Following Lyons (1990, [4]) we define a periodic tree, restate its branching number and consider a biased random walk on it. In the case of a transient walk, we describe the walk-invariant random periodic tree and calculate the asymptotic rate of escape (speed) of the walk. This is achieved by exploiting the connections between random walks and electric networks.

متن کامل

Two Badly Behaved Percolation Processes on a Nonunimodular Graph

We provide nonunimodular counterexamples to two properties that are wellknown for automorphism invariant percolation on unimodular transitive graphs. The first property is that the number of encounter points in an infinite cluster is a.s. 0 or ∞. The second property is that speed of random walk on an infinite cluster is a.s. well-defined.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009